Vector-based Realization of Multiplicatively Weighted Voronoi Diagrams with ArcGIS Engine
نویسندگان
چکیده
As a basic data structure in geometry, theoretical and computational aspects of Voronoi diagrams (VDs) and multiplicatively weighted Voronoi diagrams (MWVDs) have been widely researched and applied. But few algorithms are implemented in combination with geographic information system (GIS) softwares for practical use. A vector-based algorithm based on ArcGIS Engine (AE) is proposed to generate VDs and MWVDs for points through the methods of regions division and regions merging. New algorithm is simple and easy to understand with high precision and practicability. Generated VDs and MWVDs are convenient to store, display, output and overlay with other layers to support both vector-based and raster-based spatial analyses. It expands the application range of MWVDs in geographical field. KeywordsVDs; MWVDs; regions division; regions merging; ArcGIS Engine
منابع مشابه
Generating and updating multiplicatively weighted Voronoi diagrams for point, line and polygon features in GIS
A Voronoi diagram is an interdisciplinary concept that has been applied to many fields. In geographic information systems (GIS), existing capabilities for generating Voronoi diagrams normally focus on ordinary (not weighted) point (not linear or area) features. For better integration of Voronoi diagram models and GIS, a raster-based approach is developed, and implemented seamlessly as an ArcGIS...
متن کاملWeight-proportional Information Space Partitioning Using Adaptive Multiplicatively-Weighted Voronoi Diagrams
We define the spatial constraints and objective function for weight-proportional partitioning of information spaces. We evaluate existing methods in light of these definitions and find that none performs as desired. We then formulate an alternative approach based on an adaptive version of the multiplicatively weighted Voronoi diagram; i.e., the diagram’s weights are computed based on a set of p...
متن کاملInteractive Analysis Using Voronoi Diagrams: Algorithms to Support Dynamic Update from a Generic Triangle-based Data Structure
This paper describes a series of dynamic update methods that can be applied to a family of Voronoi diagram types, so that changes can be updated incrementally, without the usual recourse to complete reconstruction of their underlying data structure. More efficient incremental update methods are described for the ordinary Voronoi diagram, the farthest-point Voronoi diagram, the order-k Voronoi d...
متن کاملRandom Rates for 0-Extension and Low-Diameter Decompositions
Consider the problem of partitioning an arbitrary metric space into pieces of diameter at most ∆, such every pair of points is separated with relatively low probability. We propose a rate-based algorithm inspired by multiplicatively-weighted Voronoi diagrams, and prove it has optimal trade-offs. This also gives us another algorithm for the 0-extension problem.
متن کاملMesh Coarsening based upon Multiplicatively Weighted Centroidal Voronoi Diagrams
An approximated Centroidal Voronoi Diagram (CVD) construction provides an efficient and fast way for coarsening polygonal meshes. In this article a new generalization of the CVD for 3D meshes is presented a Multiplicatively Weighted Centroidal Voronoi Diagram. Based on this concept we propose a mesh coarsening algorithm which is intended to capture the mesh features as good as possible. To achi...
متن کامل